A Parallel Collision Detection Algorithm Based on Hybrid Bounding Volume Hierarchy
نویسنده
چکیده
* Supported by National Natural Science Foundation of China and Excellent Young Teacher Foundation of Education Ministry of China. Abstract One of the key problems with current interactive virtual environments is real-time collision detection. In this paper, a parallel algorithm for realtime, exact collision detection is presented. The approach adopts a hierarchical adaptive space subdivision scheme to construct a hybrid bounding representation of arbitrary non-convex polyhedra for attaining its speed, and speeds up collision detection further by traversing the built hybrid bounding volume hierarchy in parallel. The algorithm falls into MIMD synchronous parallel algorithms and is implemented with multi-threads, which enable it to run on both single processor computers and multi-processor computers. It is suitable for dynamic and complex scenes.
منابع مشابه
HPCCD: Hybrid Parallel Continuous Collision Detection using CPUs and GPUs
We present a novel, hybrid parallel continuous collision detection (HPCCD) method that exploits the availability of multi-core CPU and GPU architectures. HPCCD is based on a bounding volume hierarchy (BVH) and selectively performs lazy reconstructions. Our method works with a wide variety of deforming models and supports selfcollision detection. HPCCD takes advantage of hybrid multi-core archit...
متن کاملHybrid Collision Detection Algorithm based on Image Space
Collision detection is an important application in the field of virtual reality, and efficiently completing collision detection has become the research focus. For the poorly real-time defect of collision detection, this paper has presented an algorithm based on the hybrid collision detection, detecting the potential collision object sets quickly with the mixed bounding volume hierarchy tree, an...
متن کاملA survey of algorithms for construction of optimal Heterogeneous Bounding Volume Hierarchies
In this paper we describe algorithms for automatic object hierarchy construction. We also describe a set of properties that hierarchies must possess to be considered optimal. Based on knowledge from existing algorithms we develop and evaluate a Branch and Bound construction algorithm that searches for good hierarchies, but due to computation time, not the globally optimal hierarchy. The algorit...
متن کاملA Three-layer Hybrid Bounding Volume Hierarchy for Collision Detection
The Real-time collision detection (CD) is an important problem in virtual environments. This paper proposes a novel algorithm called SBBK which combines three different kinds of bounding volumes (BVs) together when constructing the hybrid bounding box tree for the object to make CD more accurate and faster. For illustration, CD experiments are carried out to show its advantages. The experiment ...
متن کاملSelf-Collision Detection in Tubular Objects Approximated by Spheres
We investigate the performance of an algorithm to detect selfcollisions in a tubular object approximated by spheres. The approach utilizes the Bounding Volume Hierarchy (BVH) to arrange the spheres and it was implemented using sequential and parallel algorithms. The tubular object has a snake-like motion, and the algorithm calculates the closer pairs of spheres considering the hierarchy and the...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
عنوان ژورنال:
دوره شماره
صفحات -
تاریخ انتشار 2001